2 TESTING MONOTONICITY : O ( n ) UPPER BOUND
نویسنده
چکیده
1 Overview 1.1 Last time • Proper learning for P implies property testing of P (generic, but quite inefficient) • Testing linearity (over GF[2]), i.e. P = {all parities}: (optimal) O 1-query 1-sided non-adaptive tester. • Testing monotonicity (P = {all monotone functions}: an efficient O n-query 1-sided non-adaptive tester.
منابع مشابه
An Optimal Lower Bound for Monotonicity Testing over Hypergrids
For positive integers n,d, the hypergrid [n]d is equipped with the coordinatewise product partial ordering denoted by ≺. A function f : [n]d → N is monotone if ∀x ≺ y, f (x)≤ f (y). A function f is ε-far from monotone if at least an ε fraction of values must be changed to make f monotone. Given a parameter ε , a monotonicity tester must distinguish with high probability a monotone function from...
متن کاملMonotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any ` disjoint source-sink pairs on the directed hypercube can be connected with edge-disjoint paths, then monotonicity of...
متن کاملAdaptive Lower Bound for Testing Monotonicity on the Line
In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. It is an active area of research. Recently, Pallavoor, Raskhodnikova and Varma (ITCS’17) proposed an ε-tester for monotonicity of a function f : [n] → [r], whose complex...
متن کاملOptimal bounds for monotonicity and Lipschitz testing over the hypercube
The problem of monotonicity testing of the boolean hypercube is a classic well-studied, yet unsolved question in property testing. We are given query access to f : {0, 1} 7→ R (for some ordered range R). The boolean hypercube B has a natural partial order, denoted by ≺ (defined by the product of coordinate-wise ordering). A function is monotone if all pairs x ≺ y in B, f(x) ≤ f(y). The distance...
متن کاملMonotonicity Testing
We present improved algorithms for testing monotonicity of functions. Namely, given the ability to query an unknown function f : E' -+ E, where E and E are finite ordered sets, the test always accepts a monotone f and rejects f with high probability if it is e-far from being monotone (i.e., if every monotone function differs from f on more than an E fraction of the domain). For any E > 0, the q...
متن کامل